Numerical Optimization Methods for Blind Deconvolution
نویسندگان
چکیده
This paper describes a nonlinear least squares framework to solve a separable nonlinear ill-posed inverse problems that arises in blind deconvolution. It is shown that with proper constraints and well chosen regularization parameters, it is possible to obtain an objective function that is fairly well behaved and the nonlinear minimization problem can be effectively solved by a Gauss-Newton method. Although uncertainties in the data and inaccuracies of linear solvers make it unlikely to obtain a smooth and convex objective function, it is shown that implicit filtering optimization methods can be used to avoid becoming trapped in local minima. Computational considerations, such as computing the Jacobian, are discussed, and numerical experiments are used to illustrate the behavior of the algorithms. Although the focus of the paper is on blind deconvolution, the general mathematical model addressed in this paper, and the approaches discussed to solve it, arise in many other applications.
منابع مشابه
PSO-Optimized Blind Image Deconvolution for Improved Detectability in Poor Visual Conditions
Abstract: Image restoration is a critical step in many vision applications. Due to the poor quality of Passive Millimeter Wave (PMMW) images, especially in marine and underwater environment, developing strong algorithms for the restoration of these images is of primary importance. In addition, little information about image degradation process, which is referred to as Point Spread Function (PSF...
متن کاملRegularized Gradient Descent: A Nonconvex Recipe for Fast Joint Blind Deconvolution and Demixing
We study the question of extracting a sequence of functions {fi, gi}i=1 from observing only the sum of their convolutions, i.e., from y = ∑s i=1 fi ∗ gi. While convex optimization techniques are able to solve this joint blind deconvolution-demixing problem provably and robustly under certain conditions, for medium-size or large-size problems we need computationally faster methods without sacrif...
متن کاملLow-rank spectral optimization
Various applications in signal processing and machine learning give rise to highly structured spectral optimization problems characterized by low-rank solutions. Two important examples that motivate this work are optimization problems from phase retrieval and from blind deconvolution, which are designed to yield rank-1 solutions. An algorithm is described based on solving a certain constrained ...
متن کاملRapid, Robust, and Reliable Blind Deconvolution via Nonconvex Optimization
We study the question of reconstructing two signals f and g from their convolution y = f ∗ g. This problem, known as blind deconvolution, pervades many areas of science and technology, including astronomy, medical imaging, optics, and wireless communications. A key challenge of this intricate non-convex optimization problem is that it might exhibit many local minima. We present an efficient num...
متن کاملLow-Rank Spectral Optimization via Gauge Duality
Various applications in signal processing and machine learning give rise to highly structured spectral optimization problems characterized by low-rank solutions. Two important examples that motivate this work are optimization problems from phase retrieval and from blind deconvolution, which are designed to yield rank-1 solutions. An algorithm is described that is based on solving a certain cons...
متن کامل